منابع مشابه
Embedding Meshes into the Star - Connectedcycles Interconnection
The star-connected cycles (SCC) graph was recently proposed as an attractive interconnection network for parallel processing, using a star graph to connect cycles of nodes. This paper presents embeddings of p-dimensional meshes into an n-dimensional SCC graph (1 p n), which have load 1, expansion 1, and dilation ranging from 1 to 3 + 2b(n ? 1)=2c + 2bn=4c (the dilation varies among mesh dimensi...
متن کاملEmbedding an Arbitrary Binary Tree into the Star Graph
| Binary tree structures have been very useful in solving divide-and-conquer type of problems. Embedding binary trees into another network|the host network|helps in designing solutions for the host network using the known solutions on binary trees. Embedding arbitrary binary trees into networks, in particular into the hypercube, has been addressed in the literature. The latter was achieved with...
متن کاملEmbedding Algorithm Between the Macro-star Graph and the Matrixstar Graph
The Macro-star graph which has the star graph as a basic module has node symmetry, maximum fault tolerance, and hierarchical decomposition property. And, it is an interconnection network which improves a network cost against the star graph. A Matrix-star graph also has such a good properties of the Macro-star graph and is an interconnection network which has a lower network cost than the Macro-
متن کاملOn Simultaneous Graph Embedding
We consider the problem of simultaneous embedding of planar graphs. There are two variants of this problem, one in which the mapping between the vertices of the two graphs is given and another where the mapping is not given. In particular, we show that without mapping, any number of outerplanar graphs can be embedded simultaneously on an O(n)×O(n) grid, and an outerplanar and general planar gra...
متن کاملEmbedding of Meshes on Rotator Graphs
PDCL PDCL PDCL PDCL PDCL PDCL PDCL PDCL PDCL PDCL PDCL PDCL PDCL PDCL PDCL PDCL PDCL PDCL PDCL PDCL Abstract { A set of directed permutation graphs called rotator graphs were proposed as an alternative to the star and pancake graphs for multiprocessor interconnection networks. The rotator graphs have a smaller diameter than star and pancake graphs for the same number of nodes, while sharing the...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Parallel and Distributed Computing
سال: 1993
ISSN: 0743-7315
DOI: 10.1006/jpdc.1993.1098